Subset Weight Maximization with Two Competing Agents
نویسندگان
چکیده
We consider a game of two agents competing to add items into a solution set. Each agent owns a set of weighted items and seeks to maximize the sum of their weights in the solution set. In each round each agent submits one item for inclusion in the solution. We study two natural rules to decide the winner of each round: Rule 1 picks among the two submitted items the item with larger weight, Rule 2 the item with smaller weight. The winning item is put into the solution set, the losing
منابع مشابه
Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
Given a graph G = (V;E), a weight function w : E ! R+ and a parameter k we examine a family of maximization problems arising naturally when considering a subset U V of size exactly k. Speci cally we consider the problem of nding a subset U V of size k that maximizes : Max-k-Vertex Cover : the weight of edges incident with vertices in U . Max-k-Dense Subgraph : the weight of edges in the subgrap...
متن کاملOn a Stackelberg Subset Sum Game
This contribution deals with a two-level discrete decision problem, a so-called Stackelberg strategic game: A Subset Sum setting is addressed with a set $N$ of items with given integer weights. One distinguished player, the leader, may alter the weights of the items in a given subset $L\subset N$, and a second player, the follower, selects a solution $A\subseteq N$ in order to utilize a bounded...
متن کاملUsing EM and Data Augmentation for the Competing Risks Model
We consider a survival analysis problem in which items are subject to failure from competing risks. For some of the items, the failure cause is known only to belong to a subset of the set of all possible causes, while for the remaining items the cause of death is known precisely. In this chapter we investigate two complementary analyses based on models in which the hazard rates are assumed piec...
متن کاملCompetitive Influence in Social Networks: Convergence, Submodularity, and Competition Effects
In the last 10 years, a vast amount of scientific literature has studied the problem of influence maximization. Yet, only very recently have scientists started considering the more realistic case in which competing entities try to expand their market and maximize their share via viral marketing. Goyal and Kearns [STOC 2012] present a model for the diffusion of two competing alternatives in a so...
متن کاملMinimum cost subset selection with two competing agents
We address an optimization problem in which two agents, each with a set of weighted items, compete in order to minimize the total weight of their solution sets. The latter are built according to a sequential game consisting in a fixed number of rounds. In every round each agent submits one item that may be included in its solution set. We study two natural rules to decide which item between the...
متن کامل